Searching for efficient cellular automata based keys applied in symmetric key cryptography

In this paper we consider a problem of generation by cellular automata of high quality pseudorandom sequences useful in cryptography. For this purpose one dimensional nonuniform cellular automata is used. The quality of pseudorandom sequences generated by cellular automata depends on collective behavior of rules assigned to the cellular automata cells. Genetic algorithm is used to find suitable rules from the earlier predefined set of rules. It has been shown that genetic algorithm eliminates bad subsets of rules and finds subsets of rules, which provide high quality pseudorandom sequences. These sequences are suitable for symmetric key cryptography and can be used in different cryptographic modules.